Paths and circuits in partially directed graphs
نویسندگان
چکیده
منابع مشابه
Covering partially directed graphs with directed paths
We consider graphs which contain both directed and undirected edges (partially directed graphs). We show that the problem of covering the edges of such graphs with a minimum number of edge-disjoint directed paths respecting the orientations of the directed edges is polynomially solvable.We exhibit a good characterization for this problem in the form of a min–max theorem.We introduce a more gene...
متن کاملFree partially commutative groups, cohomology, and paths and circuits in directed graphs on surfaces
We show that for each fixed k, the problem of finding k pairwise vertex-disjoint directed paths between given source-sink pairs in a planar directed graph is solvable in polynomial time. In fact, it suffices to fix the number of faces needed to cover all sources and sinks. Moreover, the method can be extended to any fixed compact orientable surface (instead of the plane) and to rooted trees (in...
متن کاملHamilton Circuits in Graphs and Directed Graphs
Let h be an arbitrary n-cycle in S n . Assume h ' is another n-cycle in S n . Then if σ = (h) 1 − h ' , σ is an element of A n , the alternating group of S n . From elementary group theory, every element of S n can be written as a product of (not necessarily disjoint) 3-cycles. Thus, h ' = hσ 1σ 2 ...σ r where each σ i (i = 1,2,...,r) is a 3-cycle. Defining h i = hσ 1σ 2 ...σ i , we now stipula...
متن کاملPartially directed paths in a wedge
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both the derivation of a functional recurrence for the generating function, and solving for it. In this paper we consider a model of partially directed walks from the origin in the square lattice confined to both a symmetri...
متن کاملPartially directed paths in a symmetric wedge
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both the derivation of a functional recurrence for the generating function, and its solution. In this paper we consider a model of partially directed walks from the origin in the square lattice confined to a symmetric wedge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00185-x